#include<iostream>
using namespace std;

struct TreeNode {
    int val;
    TreeNode* left;
    TreeNode* right;
    TreeNode() : val(0), left(nullptr), right(nullptr) {}
    TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
    TreeNode(int x, TreeNode* left, TreeNode* right) : val(x), left(left), right(right) {}
    
};

class Solution {
public:
    bool evaluateTree(TreeNode* root) {
        return dfs(root);
    }

    bool dfs(TreeNode* root)
    {
        if (root->left == nullptr)
        {
            return root->val == 0 ? false : true;
        }

        bool leftroot = dfs(root->left);
        bool rightroot = dfs(root->right);

        return root->val == 2 ? leftroot | rightroot : leftroot & rightroot;
    }
};